منابع مشابه
Testing modules for irreducibility
A practical method is described for deciding whether or not a nite-dimensional module for a group over a nite eld is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalisation of the Parker-Norton`Meataxe' algorithm, but it does not depend for its eeciency on the eld being small. The principal tools involved are the calculation of the nullspace and t...
متن کاملTesting polynomial irreducibility without GCDs
We determine classes of degrees where testing irreducibility for univariate polynomials over finite fields can be done without any GCD computation. This work was partly funded by the INRIA Associate Team “Algorithms, Numbers, Computers” (http://www.loria.fr/~zimmerma/anc.html). Key-words: finite fields, irreducible polynomial, GCD ∗ ANU, Canberra, [email protected] Test d’irréductibilité de polynôme...
متن کاملA Note on the Uniform Filling Property and Strong Irreducibility
Various separation properties of shift spaces have been defined in the literature. In [BPS], several were put into a chain of strict implications, leaving one open question: Is the uniform filling property (UFP) a strictly weaker condition than strong irreducibility (SI)? We given an example to show that it is, and we show that UFP and SI are equivalent for two-dimensional square filling shifts...
متن کاملIrreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], the ring of polynomials with coefficients from the field of Laurent series in x with rational coefficients. This is achieved by computing certain associated Puiseux expansions, and as a result, a polynomial-time complex...
متن کاملFast Parallel Absolute Irreducibility Testing
We present a fast parallel deterministic algorithm for testing multivariate integral polynomials for absolute irreducibility, that is irreducibility over the complex numbers. More precisely, we establish that the set of absolutely irreducible integral polynomials belongs to the complexity class NC of Boolean circuits of polynomial size and logarithmic depth. Therefore it also belongs to the cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1980-0583515-0